Pattern growth in elementary cellular automata
نویسندگان
چکیده
منابع مشابه
Cellular Automata: Elementary Cellular Automata
Cellular automata (CA) are discrete dynamical systems consist of a regular finite grid of cell; each cell encapsulating an equal portion of the state, and arranged spatially in a regular fashion to form an n-dimensional lattice. A cellular automata is like computers, data represented by initial configurations which is processed by time evolution to produce output. This paper is an empirical stu...
متن کاملUniversality in Elementary Cellular Automata
The purpose of this paper is to prove that one of the simplest one dimensional cellular automata is computationally universal, implying that many questions concerning its behavior, such as whether a particular sequence of bits will occur, or whether the behavior will become periodic, are formally undecidable. The cellular automaton we will prove this for is known as “Rule 110” according to Wolf...
متن کاملComplete sets of initial vectors for pattern growth with elementary cellular automata
Computer simulations of complex spatio-temporal patterns using cellular automata may be performed in two alternative ways, the better choice depending on the relative size between the spatial width W of the expected patterns and their corresponding temporal period T . While the traditional timewise updating algorithm is very efficient whenW T , the complementary spacewise algorithm wins wheneve...
متن کاملElementary Cellular Automata with Memory
Standard cellular automata (CA) are ahistoric (memoryless), that is, the new state of a cell depends on the neighborhood configuration of only the preceding time step. This article introduces an extension to the standard framework of CA by considering automata with memory capabilities. While the update rules of the CA remain unaltered, a history of all past iterations is incorporated into each ...
متن کاملUnraveling simplicity in elementary cellular automata
We show that a large number of elementary cellular automata are computationally simple. This work is the first systematic classification of elementary cellular automata based on a formal notion of computational complexity. Thanks to the generality of communication complexity, the perspectives of our method include its application to other natural systems such as neural networks and gene regulat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1995
ISSN: 0304-3975
DOI: 10.1016/0304-3975(94)00155-c